Emergency connectivity in ad-hoc networks with selfish nodes George Karakostas1,2,? and Euripides Markou2,?? 1 Department of Computing & Software. School of Computational Engineering & Science.

Source URL: www.cas.mcmaster.ca

• Graph theory
• Mathematics
• Discrete mathematics
• Network flow
• Flow network
• Operations research
• Nash equilibrium
• Flow
• Price of anarchy
• FordFulkerson algorithm

The formation of partnerships in social networks Francis Bloch† Bhaskar Dutta‡ Stéphane Robin§

Source URL: www.econ.vt.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Network theory
• Combinatorial optimization
• Networks
• Network analysis
• Bipartite graph
• Matching
• Centrality
• Graph

1 Incremental Topological Segmentation for Semi-structured Environments Ming Liu, Luc Oth, Francis Colas, Franc¸ois Pomerleau, Roland Siegwart Autonomous Systems Lab, ETH Zurich, Switzerland

Source URL: www.ee.ust.hk

• Diagrams
• Discrete geometry
• Geometry
• Computational geometry
• Voronoi diagram
• Mathematics
• Computer science
• Data mining
• Image segmentation
• Cluster analysis
• K-means clustering
• Watershed

Message passing with l1 penalized KL minimization Yuan Qi Departments of Computer Science and Statistics, Purdue University, West Lafayette, INUSA Yandong Guo

Source URL: jmlr.org

• Graphical models
• Mathematics
• KullbackLeibler divergence
• Thermodynamics
• Belief propagation
• Markov random field
• Information theory
• Divergence
• Discrete mathematics
• Applied mathematics

Discrete Mathematics and Theoretical Computer Science DMTCS vol. (subm.), by the authors, 1–1 Relaxed Two-Coloring of Cubic Graphs Robert Berke and Tibor Szab´o

Source URL: page.mi.fu-berlin.de

SIAM JOURNALS Epubs.siam.org Your link to the world of applied mathematics

Source URL: www.siam.org

• Academia
• Publishing
• Academic publishing
• Mass media
• Electronic publishing
• International Standard Serial Number
• Library science
• Electronic journal
• Society for Industrial and Applied Mathematics
• SIAM Journal on Numerical Analysis
• SIAM Journal on Discrete Mathematics
• SIAM Journal on Applied Mathematics

In Intl. J. of Robotics Research 23(9):, September2004 A formal analysis and taxonomy of task allocation in multi-robot systems Brian P. Gerkey Artificial Intelligence Lab

Source URL: robotics.stanford.edu

• Mathematics
• NP-complete problems
• Combinatorics
• Discrete mathematics
• Operations research
• Theoretical computer science
• Combinatorial optimization
• Greedy algorithm
• Matroid theory
• Robotics
• Robot
• Assignment problem

Mihyun Kang Institute of Optimization and Discrete Mathematics, Graz University of Technology Random Graphs: From Nature to Society to the Brain The theory of random graphs deals with

Source URL: www.math.tugraz.at

SYNC or ASYNC: Time to Fuse for Distributed Graph-Parallel Computation Chenning Xie† Rong Chen†

Source URL: ipads.se.sjtu.edu.cn

• Graph theory
• Mathematics
• Discrete mathematics
• Graph coloring
• NP-complete problems
• Vertex
• Neighbourhood
• Distance

Using graphs to find the best block designs arXiv:1111.3768v1 [math.ST] 16 Nov 2011 R. A. Bailey and Peter J. Cameron R. A. Bailey obtained a DPhil in group theory from the University of Oxford. She worked at the Open Un

Source URL: arxiv.org

• Mathematics
• Graph theory
• Discrete mathematics
• Algebraic graph theory
• Matrices
• Combinatorics
• Design theory
• Incidence matrix
• Laplacian matrix
• Graph
• Block design
• Graph partition